Near-Optimal Expanding Generator Sets for Solvable Permutation Groups
نویسندگان
چکیده
Let G = 〈S〉 be a solvable subgroup of the symmetric group Sn given as input by the generator set S. We give a deterministic polynomialtime algorithm that computes an expanding generator set of size Õ(n) for G. As a byproduct of our proof, we obtain a new explicit construction of ε-bias spaces of size Õ(npoly(log d))( 1 ε ) for the groups Zd .
منابع مشابه
Expanding Generator Sets for Solvable Permutation Groups
Let G = 〈S〉 be a solvable permutation group given as input by the generating set S. I.e. G is a solvable subgroup of the symmetric group Sn. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n2) for G. More precisely, given a λ < 1, we can compute a subset T ⊂ G of size Õ(n2) ( 1 λ )O(1) such that the undirected Cayley graph Cay(G,T ) is a λ-s...
متن کاملNear-Optimal Expanding Generating Sets for Solvable Permutation Groups
Let G = 〈S〉 be a solvable permutation group of the symmetric group Sn given as input by the generating set S. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n) for G. More precisely, the algorithm computes a subset T ⊂ G of size Õ(n)(1/λ) such that the undirected Cayley graph Cay(G, T ) is a λ-spectral expander (the Õ notation suppresses lo...
متن کاملThe Minimal Base Size of Primitive Solvable Permutation Groups
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. Answering a question of Pyber, we prove that all primitive solvable permutation groups have a base of size at most four.
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملLinearly Equivalent Actions of Solvable Groups
Let G be a group. A G-set is a finite set provided with a left action of g 4 G. For a G-set X and g g G we write X s x g X : gx s x . The permutation character of a G-set X is the function p from G to the ring X Z of integers that sends g to the cardinality aX g of X . We say that two G-sets X and Y are linearly equï alent if p s p . By representation X Y theory of finite groups, two G-sets X a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012